Limitations of Incentive Compatibility on Discrete Type Spaces
نویسندگان
چکیده
منابع مشابه
Monotonicity and Incentive Compatibility
Understanding multi-dimensional mechanism design. 1 The Model Let M = {1, . . . , m} be a finite set of agents. Every agent has private information, which can be multi-dimensional. This is called his type. The space from which an agent draws his type is called his type space. Let Ti denote the type space of agent i ∈ M . We assume Ti ⊆ R n for some integer n ≥ 1. Let T m = ×mi=1Ti. Also, denote...
متن کاملOn Compatibility of Discrete Relations
An approach to compatibility analysis of systems of discrete relations is proposed. Unlike the Gröbner basis technique, the proposed scheme is not based on the polynomial ring structure. It uses more primitive set-theoretic and topological concepts and constructions. We illustrate the approach by application to some two-state cellular automata. In the two-state case the Gröbner basis method is ...
متن کاملLocal incentive compatibility with transfers
We consider locally incentive compatible mechanisms with deterministic allocation rules and transfers with quasilinear utility. We identify a rich class of type spaces, which includes the single peaked type space, where local incentive compatibility does not imply incentive compatibility. Our main result shows that in such type spaces, a mechanism is locally incentive compatible and payment-onl...
متن کاملIncentive Compatibility of Large Centralized Matching Markets
We study the manipulability of stable matching mechanisms. To quantify incentives to manipulate stable mechanisms, we consider markets with random cardinal utilities, which induce ordinal preferences over match partners. We show that most agents in large matching markets are close to being indifferent overall stable matchings. In oneto-one matching, the utility gain by manipulating a stable mec...
متن کاملQuantifying Incentive Compatibility of Ranking Systems
Reasoning about agent preferences on a set of alternatives, and the aggregation of such preferences into some social ranking is a fundamental issue in reasoning about multi-agent systems. When the set of agents and the set of alternatives coincide, we get the ranking systems setting. A famous type of ranking systems are page ranking systems in the context of search engines. Such ranking systems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2020
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v34i02.5588